Divide and Conquer: A Location-Allocation Approach to Sectorization
نویسندگان
چکیده
Sectorization is concerned with dividing a large territory into smaller areas, also known as sectors. This process usually simplifies complex problem, leading to easier solution approaches solving the resulting subproblems. Sectors are built several criteria in mind, such equilibrium, compactness, contiguity, and desirability, which vary applications. appears different contexts: sales design, political districting, healthcare logistics, vehicle routing problems (agrifood distribution, winter road maintenance, parcel delivery). Environmental can be tackled sectorization approach; for example, municipal waste collection, water distribution networks, even finding more sustainable transportation routes. work focuses on concerning location of area’s centers allocating basic units each sector. Integer programming models address location-allocation problems, various formulations implementing compared. Methods deal multiobjective optimization ϵ-constraint, lexicographic, weighted sum methods, applied Computational results obtained set benchmarking instances presented.
منابع مشابه
a benchmarking approach to optimal asset allocation for insurers and pension funds
uncertainty in the financial market will be driven by underlying brownian motions, while the assets are assumed to be general stochastic processes adapted to the filtration of the brownian motions. the goal of this study is to calculate the accumulated wealth in order to optimize the expected terminal value using a suitable utility function. this thesis introduced the lim-wong’s benchmark fun...
15 صفحه اولA Divide and Conquer Approach to Sequencing
We suggest an approach to sequencing based on a \divide and conquer method". This approach eliminates the need for solving a hard NP-complete problem which arises when using traditional sequencing techniques. At the present time this algorithm has not been tried out in the lab. However, computer simulations using parts of the human genome provide some encouraging data.
متن کاملA divide-and-conquer approach to fragment assembly
MOTIVATION One of the major problems in DNA sequencing is assembling the fragments obtained by shotgun sequencing. Most existing fragment assembly techniques follow the overlap-layout-consensus approach. This framework requires extensive computation in each phase and becomes inefficient with increasing number of fragments. RESULTS We propose a new algorithm which solves the overlap, layout, a...
متن کاملA Divide and Conquer Approach to Learning from Prior Knowledge
This paper introduces a new machine learning task|model calibration|and presents a method for solving a particularly diicult model calibration task that arose as part of a global climate change research project. The model calibration task is the problem of training the free parameters of a scientiic model in order to optimize the accuracy of the model for making future predictions. It is a form...
متن کاملMinimum conflict: a divide-and-conquer approach to phylogeny estimation
MOTIVATION Fast and reliable phylogeny estimation is rapidly gaining importance as more and more genomic sequence information is becoming available, and the study of the evolution of genes and genomes accelerates our understanding in biology and medicine alike. Branch attraction phenomena due to unequal amounts of evolutionary change in different parts of the phylogeny are one major problem for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2023
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math11112553